New systolic modular multiplication architecture for efficient Montgomery multiplication
نویسندگان
چکیده
منابع مشابه
Systolic Hardware Implementation for the Montgomery Modular Multiplication
Modular multiplication is a cornerstone computation in public-key cryptography systems such as RSA cryptosystem. The operation is time consuming for large operands. This paper describes the characteristics of a systolic array-based architecture to implement modular multiplication using the fast Montgomery algorithm. The paper evaluates the prototype using the time×area classic factor. Key-Words...
متن کاملHigh-Speed Montgomery Modular Multiplication Using High-Radix Systolic Multiplier
A new high-radix systolic multiplier architecture is presented for Montgomery modular multiplication. Using a radix 2, an n-bit modular multiplication only takes about n/w+6 cycles. This leads to a competitive ASIC implementation for RSA and Elliptic Curve Cryptography (ECC).
متن کاملDesign and Evaluation of Novel Effective Montgomery Modular Multiplication Architecture
Secure communication is a challenging issue in modern industries and critical infrastructures. The core technology used for securing the communication is cryptography. Modular multiplication is an important operation in cryptosystems. This paper investigates a novel modular multiplication algorithm and architecture. In the proposed algorithm and architecture, the parallel architecture and compa...
متن کاملA Scalable Architecture for Montgomery Multiplication
This paper introduces a scalable architecture for the Montgomery multiplication operation. There is no limitation on the maximum number of bits manipulated by the multiplier, and the selection of the word-size can be made according to the available area and/or desired performance. We give a general description of the new architecture, analyze the hardware organization for parallel computation, ...
متن کاملMontgomery Modular Multiplication in Residue Arithmetic
We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery's method adapted to residue arithmetic. By choosing the moduli of the RNS system reasonably large, an eeect corresponding to a redundant high-radix implementation is achieved, due to the carry-free nature of residue arithmetic. The actual computation in the multiplication takes place in con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Electronics Express
سال: 2015
ISSN: 1349-2543
DOI: 10.1587/elex.11.20141051